A Formal Proof of Euler’s Polyhedron Formula
نویسنده
چکیده
Euler’s polyhedron formula asserts for a polyhedron p that
منابع مشابه
Euler's Polyhedron Formula
where V , E, and F are, respectively, the number of vertices, edges, and faces of p. The formula was first stated in print by Euler in 1758 [11]. The proof given here is based on Poincaré’s linear algebraic proof, stated in [17] (with a corrected proof in [18]), as adapted by Imre Lakatos in the latter’s Proofs and Refutations [15]. As is well known, Euler’s formula is not true for all polyhedr...
متن کاملDiscrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps
This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assisted by the Coq system. Fundamental properties are proven by structural or noetherian induction: Genus Theorem, Euler’s Formula, constructive planarity criteria. A notion of ring of faces is inductively defined and a ...
متن کاملOn the degrees of freedom of lattice electrodynamics
Using Euler’s formula for a network of polygons for 2D case (or polyhedra for 3D case), we show that the number of dynamic degrees of freedom of the electric field equals the number of dynamic degrees of freedom of the magnetic field for electrodynamics formulated on a lattice. Instrumental to this identity is the use (at least implicitly) of a dual lattice and of a (spatial) geometric discreti...
متن کاملAn integration of Euler's pentagonal partition
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler’s recurrence based on the pentagonal numbers, but where the coefficients result from a discrete integration of Euler’s coefficients. Both a bijective proof and one based on generating functions show the equivalence of the subjec...
متن کاملAn Automatic Proof of Euler's Formula
In this information age, everything is digitalized. The encoding of functions and the automatic proof of functions are important. This paper will discuss the automatic calculation for Taylor expansion coefficients, as an example, it can be applied to prove Euler’s formula automatically.
متن کامل